#include <bits/stdc++.h>
using namespace std;

int a[100005];
queue < int > q;

int main()
{
    freopen("duel.in", "r", stdin);
    freopen("deul.out", "w", stdout);
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
        scanf("%d", &a[i]);
    sort(a + 1, a + n + 1);
    int ans = n;
    for (int i = 2; i <= n; i++)
    {
        if (a[i] > a[i - 1])
        {
            ans--;
            q.push(a[i]);
        }
        else
        {
            int now = q.front();
            if (a[i] > now)
            {
                q.pop();
                q.push(a[i]);
                ans--;
            }
            else q.push(a[i]);
        }
    }
    printf("%d\n", ans);
    return 0;
}